Locally Differentially Private Heavy Hitter Identification

نویسندگان

چکیده

The notion of Local Differential Privacy (LDP) enables users to answer sensitive questions while preserving their privacy. basic LDP frequency oracle protocol the aggregator estimate any value. But when domain input values is large, finding most frequent values, also known as heavy hitters, by estimating frequencies all possible computationally infeasible. In this paper, we propose an for identifying hitters. our proposed protocol, which call Prefix Extending Method (PEM), are divided into groups, with each group reporting a prefix her We analyze how choose optimal parameters and identify two design principles designing protocols high utility. Experiments show that under same privacy guarantee computational cost, PEM has better utility on both synthetic real-world datasets than existing solutions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locally Differentially Private Heavy Hitter Identification

The notion of Local Differential Privacy (LDP) enables users to answer sensitive questions while preserving their privacy. The basic LDP frequent oracle protocol enables the aggregator to estimate the frequency of any value. But when the domain of input values is large, finding the most frequent values, also known as the heavy hitters, by estimating the frequencies of all possible values, is co...

متن کامل

Optimizing Locally Differentially Private Protocols

Protocols satisfying Local Differential Privacy (LDP) enable parties to collect aggregate information about a population while protecting each user’s privacy, without relying on a trusted third party. LDP protocols (such as Google’s RAPPOR) have been deployed in real-world scenarios. In these protocols, a user encodes his private information and perturbs the encoded value locally before sending...

متن کامل

Practical Locally Private Heavy Hitters

We present new heavy-hitters algorithms satisfying local-differential-privacy, with optimal or nearoptimal worst-case error, running time, and memory. In our algorithms, the server running time is $\tilde O(n)$ and user running time is $\tilde O(1)$, hence improving on the prior state-of-the-art result of Bassily and Smith [STOC 2015] requiring $O(n^{5/2})$ server time and $O(n^{3/2})$ user tim...

متن کامل

Locally Differentially Private Protocols for Frequency Estimation

Protocols satisfying Local Differential Privacy (LDP) enable parties to collect aggregate information about a population while protecting each user’s privacy, without relying on a trusted third party. LDP protocols (such as Google’s RAPPOR) have been deployed in real-world scenarios. In these protocols, a user encodes his private information and perturbs the encoded value locally before sending...

متن کامل

High Throughput Heavy Hitter Aggregation

Heavy hitters are data items that occur at high frequency in a data set. Heavy hitters are among the most important items for an organization to summarize and understand during analytical processing. In data sets with sufficient skew, the number of heavy hitters can be relatively small. We take advantage of this small footprint to compute aggregate functions for the heavy hitters in fast cache ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Dependable and Secure Computing

سال: 2021

ISSN: ['1941-0018', '1545-5971', '2160-9209']

DOI: https://doi.org/10.1109/tdsc.2019.2927695